Rank of adjacency matrices of directed (strongly) regular graphs
نویسندگان
چکیده
منابع مشابه
On the p-Rank of the Adjacency Matrices of Strongly Regular Graphs
Let F be a strongly regular graph with adjacency matrix A. Let I be the identity matrix, and J the all-1 matrix. Let p be a prime. Our aim is to study the p-rank (that is, the rank over Fp, the finite field with p elements) of the matrices M = aA + bJ + cI for integral a, b, c. This note is based on van Eijl [8]. 1. The Smith normal form Let us write M ~ N for integral matrices M and N of order...
متن کاملRepresentations of directed strongly regular graphs
We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new constructions.
متن کاملHadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property
A graph is 3-e.c. if for every 3-element subset S of the vertices, and for every subset T of S, there is a vertex not in S which is joined to every vertex in T and to no vertex in S \ T. Although almost all graphs are 3-e.c., the only known examples of strongly regular 3-e.c. graphs are Paley graphs with at least 29 vertices. We construct a new infinite family of 3-e.c. graphs, based on certain...
متن کاملdeterminants of adjacency matrices of graphs
we study the set of all determinants of adjacency matrices of graphs with a given number of vertices. using brendan mckay's data base of small graphs, determinants of graphs with at most $9$ vertices are computed so that the number of non-isomorphic graphs with given vertices whose determinants are all equal to a number is exhibited in a table. using an idea of m. newman, it is proved that if $...
متن کاملSmall vertex-transitive directed strongly regular graphs
We consider directed strongly regular graphs de2ned in 1988 by Duval. All such graphs with n vertices, n6 20, having a vertex-transitive automorphism group, are determined with the aid of a computer. As a consequence, we prove the existence of directed strongly regular graphs for three feasible parameter sets listed by Duval. For one parameter set a computer-free proof of the nonexistence is pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2005
ISSN: 0024-3795
DOI: 10.1016/j.laa.2005.05.005